Symmetry Reduction for SAT Representations of Transition Systems
نویسنده
چکیده
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if the presence of symmetries is recognized. In earlier work, symmetries in constraint satisfaction problems have been handled by introducing symmetry-breaking constraints. In reasoning about transition systems, notably in model-checking and reachability analysis in computer-aided verification, symmetries have been handled by symmetry reduction algorithms that eliminate redundant search caused by
منابع مشابه
Monomial Irreducible sln-Modules
In this article, we introduce monomial irreducible representations of the special linear Lie algebra $sln$. We will show that this kind of representations have bases for which the action of the Chevalley generators of the Lie algebra on the basis elements can be given by a simple formula.
متن کاملThe K-sat problem in a simple limit
The statistical mechanics of the random K-satisfiability (K-SAT) problem has been the object of many studies in the last years [1][2][3]. The K-SAT was the first problem to be shown to be Nondeterministic Polynomial (NP) complete [4] and the importance of such a model is that it provides a prototype for all the NP complete problems in complexity theory of computer science as well as in statisti...
متن کاملساختار فاز میدانهای پیمانه‌ای شبکه‌ای دو بعدی U(N) با کنش مختلط
We study the phase structure of two dimensional pure lattice gauge theory with a Chern term. The symmetry groups are non-Abelian, finite and disconnected sub-groups of SU(3). Since the action is imaginary it introduces a rich phase structure compared to the originally trivial two dimensional pure gauge theory. The Z3 group is the center of these groups and the result shows that if we use one ...
متن کاملImproved Static Symmetry Breaking for SAT
An effective SAT preprocessing technique is the construction of symmetry breaking formulas: auxiliary clauses that guide a SAT solver away from needless exploration of symmetric subproblems. However, during the past decade, state-of-the-art SAT solvers rarely incorporated symmetry breaking. This suggests that the reduction of the search space does not outweigh the overhead incurred by detecting...
متن کاملSolving difficult instances of Boolean satisfiability in the presence of symmetry
Research in algorithms for Boolean satisfiability (SAT) and their implementations [11, 45, 50] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks [22] can now be solved in seconds on commodity PCs. More recent benchmarks [60] take longer to solve due to their large size, but are still solved in minutes. Yet, relatively small and difficult SAT instances must exist ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003